package sjg.tenNormalAlgorithm.divideAndConquer;

import java.util.Scanner;

public class HanNuoTaGame {
    public static void main(String[] args) {
        System.out.println("=====汉诺塔游戏开始=====");
        System.out.println("请输入初始柱子盘子数量");
        Scanner sc = new Scanner(System.in);
        int num = sc.nextInt();
        System.out.println("A柱子上盘子共有" + num + "个");
        int[] a = new int[num*2];
        for (int i = 1; i < num+1; i++) {
            a[i] = num;
        }
        int[] b = new int[num];
        int[] c = new int[num];

        System.out.println("现在请开始移动 --> 1,A,B 表示将第一个盘子从A移动到B柱上");
        System.out.println("请输入要移动的盘子：");
        int i = sc.nextInt();
        System.out.println("当前盘子位于" +'A'+"柱子上");
        System.out.println("请输入要移动的位置:");
        int i2 = sc.nextInt();


        System.out.println("=====汉诺塔游戏结束=====");
    }
}
